Semidefinite programming - PDFSEARCH.IO - Document Search Engine

Semidefinite programming
Results: 217

#	Item
21	Subsampling, Spectral Methods and Semidefinite Programming Alexandre d’Aspremont, Princeton University Joint work with Noureddine El Karoui, U.C. Berkeley. Add to Reading List Source URL: www.di.ens.fr - Date: 2013-09-09 17:42:52
22	Sparse Covariance Selection using Semidefinite Programming A. d’Aspremont ORFE, Princeton University Joint work with O. Banerjee, L. El Ghaoui & G. Natsoulis, U.C. Berkeley & Iconix Pharmaceuticals Add to Reading List Source URL: www.di.ens.fr - Date: 2013-09-09 17:47:01
23	A Certified Roundoff Error Bounds Using Semidefinite Programming arXiv:1507.03331v7 [cs.NA] 25 NovVICTOR MAGRON, CNRS Verimag Add to Reading List Source URL: www.doc.ic.ac.uk - Date: 2017-06-15 17:14:58
24	On the implementation and usage of SDPT3 – a Matlab software package for semidefinite-quadratic-linear programming, version 4.0 Kim-Chuan Toh ∗, Michael J. Todd †, and Reha H. T¨ ut¨ Add to Reading List Source URL: www.optimization-online.org - Date: 2010-06-16 06:35:34
25	A direct formulation for sparse PCA using semidefinite programming Alexandre d’Aspremont EECS Dept. U.C. Berkeley Add to Reading List Source URL: eceweb.ucsd.edu - Date: 2015-07-31 19:00:25
26	CS261: A Second Course in Algorithms Lecture #20: The Maximum Cut Problem and Semidefinite Programming∗ Tim Roughgarden† March 10, 2016 Add to Reading List Source URL: theory.stanford.edu - Date: 2016-03-17 09:58:23
27	MIMO detection for higher order QAM- Semidefinite programming relaxation approach for multiuser detection of QAM Signals Add to Reading List Source URL: diamondprj.nctu.edu.tw - Date: 2014-08-22 02:42:45
28	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 Add to Reading List Source URL: www.daviddelaat.nl Language: English Graph theory Mathematics NP-complete problems Information theory Combinatorial optimization NP-hard problems Lovsz number Independent set
29	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding
30	Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress Add to Reading List Source URL: www.daviddelaat.nl Language: English Mathematics Geometry Discrete geometry NP-complete problems Circle packing Conjectures Operations research Sphere packing Independent set Tammes problem Kepler conjecture Semidefinite programming

UPDATE